A determinsitic search uses a fixed rule to decide the order in which to visit states in a search tree or search graph, and thus will always search in the same order given the same data. In contrast a stochastic search may take different choices based on random chance.
Used on Chap. 4: pages 56, 57, 80; Chap. 7: page 144; Chap. 11: pages 223, 226
Also known as deterministic